Computing Small Clause Normal Forms
نویسندگان
چکیده
منابع مشابه
On Generating Small Clause Normal Forms
In this paper we focus on two powerful techniques to obtain compact clause normal forms: Renaming of formulae and reened Skolem-ization methods. We illustrate their eeect on various examples. By an exhaustive experiment of all rst-order TPTP problems, it shows that our clause normal form transformation yields fewer clauses and fewer literals than the methods known and used so far. This often al...
متن کاملNORMAL FORM SOLUTION OF REDUCED ORDER OSCILLATING SYSTEMS
This paper describes a preliminary investigation into the use of normal form theory for modelling large non-linear dynamical systems. Limit cycle oscillations are determined for simple two-degree-of-freedom double pendulum systems. The double pendulum system is reduced into its centre manifold before computing normal forms. Normal forms are obtained using a period averaging method which is appl...
متن کاملOn Variables with Few Occurrences in Conjunctive Normal Forms
We consider the question of the existence of variables with few occurrences in boolean conjunctive normal forms (clause-sets). Let μvd(F ) for a clause-set F denote the minimal variable-degree, the minimum of the number of occurrences of variables. Our main result is an upper bound μvd(F ) ≤ nM(σ(F )) ≤ σ(F ) + 1 + log 2 (σ(F )) for lean clause-sets F in dependency on the surplus σ(F ). Lean cl...
متن کاملComputing Stable Models by Program Transformation
In analogy to the Davis-Putnam procedure we develop a new procedure for computing stable models of propositional normal disjunctive logic programs, using case analysis and simplification. Our procedure enumerates all stable models without repetition and without the need for a minimality check. Since it is not necessary to store the set of stable models explicitly, the procedure runs in polynomi...
متن کاملConstraint satisfaction problems in clausal form
This is the report-version of a mini-series of two articles [60, 61] on the foundations of conjunctive normal forms with non-boolean variables. These two parts are here bundled in one report, each part yielding a chapter. Part I We consider the problem of generalising boolean formulas in conjunctive normal form by allowing non-boolean variables, with the goal of maintaining combinatorial proper...
متن کامل